Méthode de décomposition de domaines pour l'équation de Schrödinger. (Domain decomposition method for Schrödinger equation)
نویسنده
چکیده
This thesis focuses on the development and the implementation of domain decomposition methods for the linear and non-linear, one dimensional and two dimensional Schrödinger equations. In the first part, we focus on the Schwarz waveform relaxation method (SWR) for the one dimensional Schrödinger equation. In the case the potential is linear and time-independent, we propose a new algorithm that is scalable and allows a significant reduction of computation time compared with the classical algorithm. For a time-dependent linear potential or a non-linear potential, we use a previously defined linear operator as preconditioner. This ensures high scalability. We also generalize the work of Halpern and Szeftel on transmission condition. We use the absorbing boundary conditions recently constructed by Antoine, Besse and Klein as the transmission condition. We also carry the codes developed on Cpu on Gpus accelerator (graphics card) for the one dimensional Schrödinger equation. The second part concerns the SWR method and the domain decomposition in space method for the Schrödinger equation in two dimensions. We generalize the new algorithm and the preconditioned algorithm proposed in the first part to the case of two dimensions. Furthermore, in Chapter 6, we generalize the work of Loisel on the optimized Schwarz method with cross points for the Laplace equation, which leads to the SWR method with cross points. In the last part, we apply the domain decomposition methods présented in the previous chapters to the simulation of Bose-Einstein condensate, that could not only reduce the total computation time, but also realise the simulations which are not possible on a single calculation node.
منابع مشابه
Iterative Methods for Model Reduction by Domain Decomposition
We propose a method to reduce the computational effort to solve a partial differential equation on a given domain. The main idea is to split the domain of interest in two subdomains, and to use different approximation methods in each of the two subdomains. In particular, in one subdomain we discretize the governing equations by a canonical scheme, whereas in the other one we solve a reduced ord...
متن کاملOn domain decomposition with space filling curves for the parallel solution of the coupled Maxwell/Vlasov equations
Space filling Curves (SFCs) are increasingly used for combinatorial scientific computing and in particular for designing fast domain decomposition (partitioning) methods. In the context of parallel particle simulations for solving the system of Maxwell/Vlasov equations with a coupled FE/PIC (Finite Element/Particle-In-Cell) unstructured mesh based solver, one has to deal with a two-constraint p...
متن کاملStreamline diffusion methods for the Vlasov-Poisson equation
— We prove error estimâtes for the streamline diffusion and the discontinuous Galerkin finite element methods for discretization of the Vlasov-Poisson équation. Résumé. — Nous démontrons des estimations d'erreur pour la méthode de Galerkin discontinue pour la discrétisation de l'équation de Vlasov-Poisson.
متن کاملOn a class of conservative, highly accurate Galerkin methods for the Schrödinger equation
— We construct and analyze efficient fully discrete Galerkin type methods, that are of high order of accuracy and conservative in the L sense,for approximating the solution ofaform of the linear Schrödinger équation with a time-dependent coefficient, found e.g. in underwater acoustics. The time stepping procedures are based on the class of implicit Runge-Kutta methods known as the q-stage Gauss...
متن کاملA hybridizable discontinuous Galerkin method combined to a Schwarz algorithm for the solution of 3d time-harmonic Maxwell's equation
A Schwarz-type domain decomposition method is presented for the solution of the system of 3d time-harmonic Maxwell equations. We introduce a hybridizable discontinuous Galerkin (HDG) scheme for the discretization of the problem based on a tetrahedrization of the computational domain. The discrete system of the HDG method on each subdomain is solved by an optimized sparse direct (LU factorizatio...
متن کامل